Structure of strongly coupled, multi-component plasmas

We investigate the short-range structure in strongly coupled fluidlike plasmas using the hypernetted chain approach generalized to multicomponent systems. Good agreement with numerical simulations validates this method for the parameters considered. We found a strong mutual impact on the spatial arrangement for systems with multiple ion species which is most clearly pronounced in the static structure factor. Quantum pseudopotentials were used to mimic diffraction and exchange effects in dense electron-ion systems. We demonstrate that the different kinds of pseudopotentials proposed lead to large differences in both the pair distributions and structure factors. Large discrepancies were also found in the predicted ion feature of the x-ray scattering signal, illustrating the need for comparison with full quantum calculations or experimental verification

Quantum Analogue Computing

We briefly review what a quantum computer is, what it promises to do for us, and why it is so hard to build one. Among the first applications anticipated to bear fruit is quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data is encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is how data is encoded in a classical analogue computer. There is no binary encoding, and increasing precision becomes exponentially costly: an extra bit of precision doubles the size of the computer. This has important consequences for both the precision and error correction requirements of quantum simulation, and significant open questions remain about its practicality. It also means that the quantum version of analogue computers, continuous variable quantum computers (CVQC) becomes an equally efficient architecture for quantum simulation. Lessons from past use of classical analogue computers can help us to build better quantum simulators in future.Comment: 10 pages, to appear in the Visions 2010 issue of Phil. Trans. Roy. Soc.

Measurement of an integral of a classical field with a single quantum particle

A method for measuring an integral of a classical field via local interaction of a single quantum particle in a superposition of 2^N states is presented. The method is as efficient as a quantum method with N qubits passing through the field one at a time and it is exponentially better than any known classical method that uses N bits passing through the field one at a time. A related method for searching a string with a quantum particle is proposed.Comment: 3 page

VLSI architectures for computing multiplications and inverses in GF(2-m)

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that are easily realized on VLSI chips. Massey and Omura recently developed a new multiplication algorithm for Galois fields based on a normal basis representation. A pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2m). With the simple squaring property of the normal-basis representation used together with this multiplier, a pipeline architecture is also developed for computing inverse elements in GF(2m). The designs developed for the Massey-Omura multiplier and the computation of inverse elements are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation

Conditional Quantum Dynamics and Logic Gates

Quantum logic gates provide fundamental examples of conditional quantum dynamics. They could form the building blocks of general quantum information processing systems which have recently been shown to have many interesting non--classical properties. We describe a simple quantum logic gate, the quantum controlled--NOT, and analyse some of its applications. We discuss two possible physical realisations of the gate; one based on Ramsey atomic interferometry and the other on the selective driving of optical resonances of two subsystems undergoing a dipole--dipole interaction.Comment: 5 pages, RevTeX, two figures in a uuencoded, compressed fil

Hysteresis multicycles in nanomagnet arrays

We predict two new physical effects in arrays of single-domain nanomagnets by performing simulations using a realistic model Hamiltonian and physical parameters. First, we find hysteretic multicycles for such nanomagnets. The simulation uses continuous spin dynamics through the Landau-Lifshitz-Gilbert (LLG) equation. In some regions of parameter space, the probability of finding a multicycle is as high as ~0.6. We find that systems with larger and more anisotropic nanomagnets tend to display more multicycles. This result demonstrates the importance of disorder and frustration for multicycle behavior. We also show that there is a fundamental difference between the more realistic vector LLG equation and scalar models of hysteresis, such as Ising models. In the latter case, spin and external field inversion symmetry is obeyed but in the former it is destroyed by the dynamics, with important experimental implications.Comment: 7 pages, 2 figure

Quantum-state filtering applied to the discrimination of Boolean functions

Quantum state filtering is a variant of the unambiguous state discrimination problem: the states are grouped in sets and we want to determine to which particular set a given input state belongs.The simplest case, when the N given states are divided into two subsets and the first set consists of one state only while the second consists of all of the remaining states, is termed quantum state filtering. We derived previously the optimal strategy for the case of N non-orthogonal states, {|\psi_{1} >, ..., |\psi_{N} >}, for distinguishing |\psi_1 > from the set {|\psi_2 >, ..., |\psi_N >} and the corresponding optimal success and failure probabilities. In a previous paper [PRL 90, 257901 (2003)], we sketched an appplication of the results to probabilistic quantum algorithms. Here we fill in the gaps and give the complete derivation of the probabilstic quantum algorithm that can optimally distinguish between two classes of Boolean functions, that of the balanced functions and that of the biased functions. The algorithm is probabilistic, it fails sometimes but when it does it lets us know that it did. Our approach can be considered as a generalization of the Deutsch-Jozsa algorithm that was developed for the discrimination of balanced and constant Boolean functions.Comment: 8 page

Experimental study of optimal measurements for quantum state tomography

Quantum tomography is a critically important tool to evaluate quantum hardware, making it essential to develop optimized measurement strategies that are both accurate and efficient. We compare a variety of strategies using nearly pure test states. Those that are informationally complete for all states are found to be accurate and reliable even in the presence of errors in the measurements themselves, while those designed to be complete only for pure states are far more efficient but highly sensitive to such errors. Our results highlight the unavoidable tradeoffs inherent to quantum tomography.Comment: 5 pages, 3 figure